Building Certified Static Analysers by Modular Construction of Well-founded Lattices

نویسنده

  • David Pichardie
چکیده

This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq module functors for constructing complex lattices using efficient data structures. The lattice signature contains a well-foundedness proof obligation which ensures termination of generic fixpoint iteration algorithms. With this library, complex well-foundedness proofs can hence be constructed in a functorial fashion. This paper contains two distinct contributions. We first demonstrate the ability of the recent Coq module system in manipulating algebraic structures and extracting efficient Ocaml implementations from them. The second contribution is a generic result, based on the constructive notion of accessibility predicate, about preservation of accessibility properties when combining relations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MODULARITY OF AJMAL FOR THE LATTICES OF FUZZY IDEALS OF A RING

In this paper, we construct two fuzzy sets using the notions of level subsets and strong level subsets of a given fuzzy set in a ring R. These fuzzy sets turn out to be identical and provide a universal construction of a fuzzy ideal generated by a given fuzzy set in a ring. Using this construction and employing the technique of strong level subsets, we provide the shortest and direct fuzzy set ...

متن کامل

Extracting a Data Flow Analyser in Constructive Logic

A constraint-based data flow analysis is formalised in the specification language of the Coq proof assistant. This involves defining a dependent type of lattices together with a library of lattice functors for modular construction of complex abstract domains. Constraints are represented in a way that allows for both efficient constraint resolution and correctness proof of the analysis with resp...

متن کامل

A characterization of well-founced algebraic lattices

We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice L is well-founded if and only if K(L), the join-semilattice of compact elements of L, is well-founded and contains neither [ω], nor Ω(ω∗) as a join-subsemilattice. As an immediate corollary, we get that...

متن کامل

Modular Proof Principles for Parameterised Concretizations

Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctness proof is machine checked for realistic languages To deal with complex concrete and abstract domains, the notion of parameterised concretization has been proposed to allow a structural decomposition of the abstract domain an...

متن کامل

Modular Lattices from a Variation of Construction A over Number Fields

We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus on modular and unimodular lattices, obtained in the particular cases of totally real, respectively, imaginary, quadratic fields. Our motivation comes from c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 212  شماره 

صفحات  -

تاریخ انتشار 2008